Alpha-Beta Search Enhancements with a Real-Value Game-State Evaluation Function
نویسندگان
چکیده
The note presents results of applying several Alpha-Beta search enhancements in the game of giveaway checkers with a real-value state evaluation function. In particular, the MTD-bi (bisection) algorithm is tested and compared (1) with MTD(f ) and (2) with Alpha-Beta search enhanced with transposition tables and the history heuristic. The results show that in the real-value domain the MTD(f ) algorithm becomes impractical and loses its superiority over MTD-bi. Several remarks concerning possible implementations of different replacement schemes in transposition tables are presented and discussed.
منابع مشابه
Real-Time Solving of Quantified CSPs Based on Monte-Carlo Game Tree Search
We develop a real-time algorithm based on a Monte-Carlo game tree search for solving a quantified constraint satisfaction problem (QCSP), which is a CSP where some variables are universally quantified. A universally quantified variable represents a choice of nature or an adversary. The goal of a QCSP is to make a robust plan against an adversary. However, obtaining a complete plan off-line is i...
متن کاملThe History Heuristic and Alpha-Beta Search Enhancements in Practice
Many enhancements to the alpha-beta algorithm have been proposed to help reduce the size of minimax trees. A recent enhancement, the history heuristic, is described that improves the order in which branches are considered at interior nodes. A comprehensive set of experiments is reported which tries all combinations of enhancements to determine which one yields the best performance. Previous wor...
متن کاملPartial order bounding: A new approach to evaluation in game tree search
In computer game-playing, the established method for constructing an evaluation function uses a scalar value computed as a weighted sum of features. This paper advocates the use of partial order evaluation, and describes an efficient new search method called partial order bounding (POB). Previous tree search algorithms using a partial order evaluation have attempted to propagate partially order...
متن کاملOn Optimal Game-Tree Search using Rational Meta-Reasoning
In this paper we outline a general approach to the study of problem-solving, in which search steps are considered decisions in the same sense as actions in the world. Unlike other metrics in the l i terature, the value of a search step is defined as a real u t i l i t y rather than as a quasiut i l i ty , and can therefore be computed directly f rom a model of the base-level problem-solver. We ...
متن کاملFast Heuristic Search for RTS Game Combat Scenarios
Heuristic search has been very successful in abstract game domains such as Chess and Go. In video games, however, adoption has been slow due to the fact that state and move spaces are much larger, real-time constraints are harsher, and constraints on computational resources are tighter. In this paper we present a fast search method — Alpha-Beta search for durative moves — that can defeat common...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- ICGA Journal
دوره 27 شماره
صفحات -
تاریخ انتشار 2004